MIPping Closures: An Instant Survey

A relevant amount of work has been devoted very recently to modeling and (heuristically) solving the NP-hard separation problem of famous classes of valid inequalities for mixed integer linear programs (MIPs). This task has been accomplished by using, in turn, mixed-integer linear models for the separation problem, and a general-purpose solver to actually find violated cuts—the so-called MIPping approach. We instantly survey these attempts by discussing their computational outcome and pointing out their practical interest for future integration in the MIP solvers.